Coded Emulation of Shared Atomic Memory for Message Passing Architectures
نویسندگان
چکیده
This paper considers the communication and storage costs of emulating atomic (linearizable) read/write shared memory in distributed messagepassing systems. We analyze the costs of previously-proposed algorithms by Attiya, Bar-Noy, and Dolev (the ABD algorithm) and by Fan and Lynch (the LDR algorithm), and develop new coding-based algorithms that significantly reduce these costs. The paper contains three main contributions: (1) We present a new shared-memory algorithm that we call CAS, for Coded Atomic Storage. This algorithm uses erasure coding methods. (2) In a storage system withN servers that is resilient to f server failures, we show that the communication costs for the ABD and LDR algorithms, measured in terms of number of object values, are both at least f + 1, whereas the communication cost for CAS is N N−2f . (3) We also explicitly quantify the storage costs of the ABD, LDR, and CAS algorithms. The storage cost of the ABD algorithm, measured in terms of number of object values, is N, whereas the storage costs of the LDR and CAS algorithms are both unbounded. We present a modification of the CAS algorithm based on the idea of garbage collection. The modified version of CAS has a storage cost of (δ + 1) N N−2f , where δ in an upper bound on the number of operations that are concurrent with a read operation. Thus, if δ is sufficiently small, the storage cost of CAS is lower than those of both the ABD and LDR algorithms.
منابع مشابه
Graceful Quorum Reconfiguration in a Robust Emulation of Shared Memory
Providing shared-memory abstraction in messagepassing systems often simplifies the development of distributed algorithms and allows for the reuse of sharedmemory algorithms in the message-passing setting. A robust emulation of atomic single-writer/multi-reader registers in message-passing systems was developed by Attiya, Bar-Noy and Dolev (1995). This emulation was extended by Lynch and Shvarts...
متن کاملComputationally Light "Multi-Speed" Atomic Memory
Communication demands are usually the leading factor that defines the efficiency of operations on a read/write shared memory emulation in the message-passing environment. In the quest for minimizing the communication demands, the algorithms proposed either require restrictions in the system or incur high computation demands. As a result, such solutions may be not suitable to be used in practice...
متن کاملTransactional Memory
Shared memory parallel architectures present a single unified address space to each processor. Usually the memory is physically distributed across the system but each processor is able to access any part of it through a single address space. The system hardware is responsible for presenting this abstraction to each processor. Communication between processors is done implicitly through normal me...
متن کاملEvaluating the Performance of Software Distributed Shared Memory as a Target for Parallelizing Compilers
In this paper, we evaluate the use of software distributed shared memory (DSM) on a message passing machine as the target for a parallelizing compiler. We compare this approach to compiler-generated message passing, hand-coded software DSM, and hand-coded message passing. For this comparison, we use six applications: four that are regular and two that are irregular. Our results are gathered on ...
متن کاملStorage-Efficient Shared Memory Emulation
Improvements in communication fabrics have enabled access to ever larger pools of data with decreasing access latencies, bringing large-scale memory fabrics closer to feasibility. However, with an increase in scale come new challenges. Since more systems are aggregated, maintaining a certain level of reliability requires increasing the storage redundancy, typically via data replication. The cor...
متن کامل